[4] Chiang Lee, Chi-Sheng Shih, and Yaw-Huei Chen. Optimizing large join queries using a graph-based approach. IEEE Trans. Knowl. Data Eng., 13(2):298–315, 2001.
نویسندگان
چکیده
References [1] Leonidas Fegaras. A new heuristic for optimizing large queries. [2] Toshihide Ibaraki and Tiko Kameda. On the optimal nesting order for computing n-relational joins. Optimizing large join queries using a graph-based approach. [5] Guido Moerkotte and Thomas Neumann. Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products.
منابع مشابه
IEEE Trans. Knowl. Data Eng., 13(2):298–315, 2001.
References [1] Leonidas Fegaras. A new heuristic for optimizing large queries. [2] Toshihide Ibaraki and Tiko Kameda. On the optimal nesting order for computing n-relational joins. Optimizing large join queries using a graph-based approach. [5] Guido Moerkotte and Thomas Neumann. Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees wi...
متن کاملOptimizing Large Join Queries Using A Graph-Based Approach
ÐAlthough many query tree optimization strategies have been proposed in the literature, there still is a lack of a formal and complete representation of all possible permutations of query operations (i.e., execution plans) in a uniform manner. A graph-theoretic approach presented in this paper provides a sound mathematical basis for representing a query and searching for an execution plan. In t...
متن کاملEfficient Processing of Nested Fuzzy SQL Queries in a Fuzzy Database
ÐIn a fuzzy relational database where a relation is a fuzzy set of tuples and ill-known data are represented by possibility distributions, nested fuzzy queries can be expressed in the Fuzzy SQL language, as defined in [25], [23]. Although it provides a very convenient way for users to express complex queries, a nested fuzzy query may be very inefficient to process with the naive evaluation meth...
متن کاملApplying Segmented Right-Deep Trees to Pipelining Multiple Hash Joins
The pipelined execution of multijoin queries in a multiprocessor-based database system is explored in this paper. Using hash-based joins, multiple joins can be pipelined so that the early results from a join, before the whole join is completed, are sent to the next join for processing. The execut ion of a query is usually denoted by a query execution tree. To improve the execution of pipelined ...
متن کاملParallel Optimization of Large Join Queries with Set Operators and Aggregates in a Parallel Environment Supporting Pipeline
We propose a parallel optimizer for queries containing a large number of joins, as well as set operators and aggregate functions. The platform of execution is a shared-disk multiprocessor machine supporting bushy parallelism and pipeline. Our model partitions the query into almost independent subtrees that can be optimized simultaneously and applies an enhanced variation of the iterative improv...
متن کامل